Global cycle properties in locally connected, locally traceable and locally hamiltonian graphs
نویسندگان
چکیده
منابع مشابه
Traceability of locally hamiltonian and locally traceable graphs
If P is a given graph property, we say that a graph G is locally P if 〈N(v)〉 has property P for every v ∈ V (G) where 〈N(v)〉 is the induced graph on the open neighbourhood of the vertex v. Pareek and Skupień (C. M. Pareek and Z. Skupień, On the smallest non-Hamiltonian locally Hamiltonian graph, J. Univ. Kuwait (Sci.), 10:9 17, 1983) posed the following two questions. Question 1 Is 9 the smalle...
متن کاملHamiltonian N2-locally connected claw-free graphs
A graph G is N2-locally connected if for every vertex v in G, the edges not incident with v but having at least one end adjacent to v in G induce a connected graph. In 1990, Ryjác̆ek conjectured that every 3-connected N2-locally connected claw-free graph is hamiltonian. This conjecture is proved in this note.
متن کاملHamiltonian properties of almost locally connected claw-free graphs
A vertex v of a graph G is locally connected if the set of neighbors N(v) of v induces a connected subgraph in G. Let B(G) denote the set of vertices of G that are not locally connected. Then G is almost locally connected if B(G) is an independent set and for any x ∈ B(G), there is a vertex y in V (G) \ {x} such that N(x) ∪ {y} induces a connected subgraph of G. The main result of this paper is...
متن کاملLocally connected spanning trees on graphs
A locally connected spanning tree of a graph G is a spanning tree T of G such that the set of all neighbors of v in T induces a connected subgraph of G for every v ∈ V (G). The purpose of this paper is to give linear-time algorithms for finding locally connected spanning trees on strongly chordal graphs and proper circular-arc graphs, respectively.
متن کاملLower Bounds for Locally Highly Connected Graphs
We propose a conjecture regarding the lower bound for the number of edges in locally k-connected graphs and we prove it for k = 2. In particular, we show that every connected locally 2-connected graph is M3-rigid. For the special case of surface triangulations, this fact was known before using topological methods. We generalize this result to all locally 2-connected graphs and give a purely com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.09.022